How Many Pop-Stacks Does It Take To Sort A Permutation?
نویسندگان
چکیده
Abstract Pop-stacks are variants of stacks that were introduced by Avis and Newborn in 1981. Coincidentally, a 1982 result Unger implies every permutation length $n$ can be sorted $n-1$ passes through deterministic pop-stack. We give new proof this inspired Knuth’s zero-one principle.
منابع مشابه
Cancer : How many genes does it take ?
Correspondence re: Zimonjic et al. 2001. "Derivation of human tumor cells in vitro without widespread genomic instability." Cancer Res no. 61 (24):8838-44. Submitted to Cancer Research 8/19/2002, rejected 8/29/2002 1 2
متن کاملHow many features does it take to change a lightbulb?
In the 1970s and 80s Cognitive Science and Cognitive Linguistics and Computational Psycholinguistics emerged as the boxes around our disciplines started to become straight-jackets, and research out of one discipline would start to make waves in others. The toy systems of Artificial Intelligence were reaching limits, and introspection by programmers and engineers was reinventing square wheels wi...
متن کاملHow Many Neurons Does it Take to Make a Mind?
The human race has made great strides in understanding the world around us, but the understanding of why it is we understand eludes us! We know that thought originates in the brain, we know that the brain is a network of billions of cells called neurons, we know that neurons transmit electric signals between one another and we even know how they transmit these signals, but we still do not know ...
متن کاملHow many mutations does it take to make a tumor?
I this issue of PNAS, Stoler and colleagues report that typical sporadic colorectal cancers on average contain at least 11,000 genomic alterations per cell (1). Furthermore, they report that the genomic instability responsible for generating this number of mutations starts very early in the neoplastic process and can be found in adenomatous polyps, which are known to be the precursors of cancer...
متن کاملHow Many Ants Does It Take to Find the Food?
Consider the Ants Nearby Treasure Search (ANTS) problem, where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. The agents are controlled by deterministic/randomized finite or pushdown automata and are able to communicate with each other through constant-size messages. We show that the minimum number of agents requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2021
ISSN: ['0010-4620', '1460-2067']
DOI: https://doi.org/10.1093/comjnl/bxab092